Structure of n-clique networks embedded in a complex network

نویسندگان

  • Kazuhiro Takemoto
  • Chikoo Oosawa
  • Tatsuya Akutsu
چکیده

We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a complex network using the degree distribution and the clustering spectrum. Furthermore, using our theoretical predictions, we find that the statistical properties are invariant between 3-clique networks and original networks for several observable real-world networks with the scale-free connectivity and the hierarchical modularity. The result implies that structural properties are identical between the 3-clique networks and the original networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays

In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...

متن کامل

Finding the maximum clique in massive graphs

1. ABSTRACT Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NPhard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in...

متن کامل

An Improved Transiently Chaotic Neural Network to Maximum Clique Problem

By analyzing the dynamics behavior and parameter distribution of the transiently chaotic neural network, we propose an improved transiently neural network model with new embedded back-end chaotic dynamics for combinatorial optimization problem and test it on the maximum clique problem. With the new embedded back-end chaotic dynamics, the proposed model can get enough chaotic dynamics to do glob...

متن کامل

Sensitivity Analysis of the Effect of Pore Structure and Geometry on Petrophysical and Electrical Properties of Tight Media: Random Network Modeling

Several methodologies published in the literature can be used to construct realistic pore networks for simple rocks, whereas in complex pore geometry formations, as formed in tight reservoirs, such a construction still remains a challenge. A basic understanding of pore structure and topology is essential to overcome the challenges associated with the pore scale modeling of tight porous media. A...

متن کامل

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007